Sparse zonal harmonic factorization for efficient SH rotation
نویسندگان
چکیده
منابع مشابه
Sparse Zonal Harmonic Factorization for Efficient SH Rotation: Supplemental Material and Implementation Sketch
This document supplements the submitted manuscript with elaborations on our investigation motivating the selection criteria for sparsity-promoting candidate lobe directions, details on forming doubleand triple-product integrals entirely (or partially) in the RZHB, and includes source code for both the standard and GPU-accelerated signal-tailored rotation algorithms. Moreover, we include MATLAB ...
متن کاملEfficient Bayesian inference for harmonic models via adaptive posterior factorization
Harmonic sinusoidal models are an essential tool for music audio signal analysis. Bayesian harmonic models are particularly interesting, since they allow the joint exploitation of various priors on the model parameters. However existing inference methods often rely on specific prior distributions and remain computationally demanding for realistic data. In this article, we investigate a generic ...
متن کاملEfficient Structured Multifrontal Factorization for General Large Sparse Matrices
Rank structures provide an opportunity to develop new efficient numerical methods for practical problems, when the off-diagonal blocks of certain dense intermediate matrices have small (numerical) ranks. In this work, we present a framework of structured direct factorizations for general sparse matrices, including discretized PDEs on general meshes, based on the multifrontal method and hierarch...
متن کاملEfficient Methods for Out-of-Core Sparse Cholesky Factorization
We consider the problem of sparse Cholesky factorization with limited main memory. The goal is to e ciently factor matrices whose Cholesky factors essentially ll the available disk storage, using very little memory (as little as 16 Mbytes). This would enable very large industrial problems to be solved with workstations of very modest cost. We consider three candidate algorithms. Each is based o...
متن کاملS+: Efficient 2D Sparse LU Factorization on Parallel Machines
Static symbolic factorization coupled with supernode partitioning and asynchronous computation scheduling can achieve high giga op rates for parallel sparse LU factorization with partial pivoting This paper studies properties of elimination forests and uses them to optimize supernode partitioning amalgamation and execution scheduling It also proposes supernodal matrix multiplication to speed up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2012
ISSN: 0730-0301,1557-7368
DOI: 10.1145/2167076.2167081